Using Hierarchical Decomposition to Speed Up Average Consensus
نویسندگان
چکیده
منابع مشابه
Using Hierarchical Decomposition to Speed up Average Consensus
We study the continuous-time consensus problem where nodes on a graph attempt to reach average consensus. We consider communication graphs that can be decomposed into a hierarchical structure and present a consensus scheme that exploits this hierarchical topology. The scheme consists of splitting the overall graph into layers of smaller connected subgraphs. Consensus is performed within the ind...
متن کاملNonlinear Average Consensus
We present an algorithm for nonlinear consensus in complex networks. Our motivation draws from analysis on the algorithm based on a weighted linear update protocol. Comparison of the asymptotic with early convergence rate encourages an alternative algorithm which exploits both stages.
متن کاملSpeed Up RF Mixed-Signal Simulation Using Novel Hierarchical Fast Envelope Simulation
With the fast growing personal communication and electronic markets system-on-chip (SoC) and system-in-package (SiP) circuit design has become an indispensable area in EDA. SoC integrates different types of circuits including digital, analog, and RF contents on one chip. SiP assembles all the electronic components including digital ICs, analog ICs, RFICs, and passive components in one package. ...
متن کاملKnowledge Media Institute Hierarchical clustering speed up using position lists and data position hierarchy
The aim of this paper is to address the nature of hierarchical clustering problems in systems with very large numbers of entities, and to propose specific speed improvements in the clustering algorithm. The motivation for this theme arises from the challenge of visualising the geographic and logical distribution of many tens of thousands of distance-learning students at the UK's Open University...
متن کاملEfficient quantization for average consensus
This paper presents an algorithm which solves exponentially fast the average consensus problem on strongly connected network of digital links. The algorithm is based on an efficient zooming-in/zooming-out quantization scheme.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 2008
ISSN: 1474-6670
DOI: 10.3182/20080706-5-kr-1001.00103